Biclique Decompositions and Hermitian Rank
نویسندگان
چکیده
The Hermitian rank, h(A), of a Hermitian matrix A is de ned and shown to equal maxfn+(A); n (A)g, the maximum of the numbers of positive and negative eigenvalues of A. Properties of Hermitian rank are developed and used to obtain results on the minimum number, b(G), of complete bipartite subgraphs needed to partition the edge set of a graph G. Witsenhausen's inequality b(G) maxfn+(G); n (G)g is reproved and conditions necessary for equality to hold are given. The results are then used to estimate b(G) for several classes of graphs. For example, if G is the complement of a path then b(G) = b 3 (n 1)c, while if G is the complement of a cycle then b(G) = 2b 1 3 c or b 1 3 c.
منابع مشابه
The Combinatorics of Conflicts between Clauses
We study the symmetric conflict matrix of a multi-clause-set, where the entry at position (i, j) is the number of clashes between clauses i and j. The conflict matrix of a multi-clause-set, either interpreted as a multi-graph or a distance matrix, yields a new link between investigations on the satisfiability problem (in a wider sense) and investigations on the biclique partition number and on ...
متن کاملInertia and biclique decompositions of joins of graphs
Throughout the paper, G denotes a graph that has no loops, but that may have multiple edges. The multi-set of edges of G is denoted by E(G). A graph G is simple if it has no (loops or) multiple edges. A biclique of G is a simple complete bipartite subgraph of G. A biclique decomposition of G is a collection of bicliques of G, such that each edge of G is in precisely one of the bicliques in the ...
متن کاملFractional Biclique Covers and Partitions of Graphs
A biclique is a complete bipartite subgraph of a graph. This paper investigates the fractional biclique cover number, bc∗(G), and the fractional biclique partition number, bp∗(G), of a graph G. It is observed that bc∗(G) and bp∗(G) provide lower bounds on the biclique cover and partition numbers respectively, and conditions for equality are given. It is also shown that bc∗(G) is a better lower ...
متن کاملInvestigation on the Hermitian matrix expression subject to some consistent equations
In this paper, we study the extremal ranks and inertias of the Hermitian matrix expression $$ f(X,Y)=C_{4}-B_{4}Y-(B_{4}Y)^{*}-A_{4}XA_{4}^{*},$$ where $C_{4}$ is Hermitian, $*$ denotes the conjugate transpose, $X$ and $Y$ satisfy the following consistent system of matrix equations $A_{3}Y=C_{3}, A_{1}X=C_{1},XB_{1}=D_{1},A_{2}XA_{2}^{*}=C_{2},X=X^{*}.$ As consequences, we g...
متن کاملOrdered Biclique Partitions and Communication Complexity Problems
An ordered biclique partition of the complete graph Kn on n vertices is a collection of bicliques (i.e., complete bipartite graphs) such that (i) every edge of Kn is covered by at least one and at most two bicliques in the collection, and (ii) if an edge e is covered by two bicliques then each endpoint of e is in the first class in one of these bicliques and in the second class in other one. In...
متن کامل